$-calculus Bounded Rationality = Process Algebra + Anytime Algorithms

$-calculus is a higher-order polyadic process algebra with a utility (cost) integrating deliberative and reactive approaches for action selection in real time, and allowing to capture bounded optimization and metaresoning in distributed interactive AI systems. In this paper we present basic notions of $-calculus and demonstrate the versatility of its k meta-control to plan behaviors for single and multiple agents. The approach can be understood as a generic proposal of a computational theory of AI based on search and optimization under bounded resources.